Sharp Bounds for Symmetric and Asymmetric Diophantine Approximation Cor Kraaikamp and Ionica Smeets
نویسنده
چکیده
In 2004, J.C. Tong found bounds for the approximation quality of a regular continued fraction convergent of a rational number, expressed in bounds for both the previous and next approximation. We sharpen his results with a geometric method and give both sharp upper and lower bounds. We also calculate the asymptotic frequency that these bounds occur.
منابع مشابه
S-expansions in Dimension Two
The technique of singularization was developped by C. Kraaikamp during the nineties, in connection with his work on dynamical systems related to continued fraction algorithms and their diophantine approximation properties. We generalize this technique from one into two dimensions. We apply the method to the the two dimensional Brun’s algorithm. We discuss, how this technique, and related ones, ...
متن کاملApproximation Hardness of TSP with Bounded Metrics ( Revised
The general asymmetric TSP with triangle inequality is known to be approximable only to within an O(log n) factor, and is also known to be approximable within a constant factor as soon as the metric is bounded. In this paper we study the asymmetric and symmetric TSP problems with bounded metrics and prove approximation lower bounds of 131=130 and 174=173, respectively, for these problems, impro...
متن کاملApproximation Hardness of TSP with Bounded Metrics
The general asymmetric TSP with triangle inequality is known to be approximable only within an O(log n) factor, and is also known to be approximable within a constant factor as soon as the metric is bounded. In this paper we study the asymmetric and symmetric TSP problems with bounded metrics, i.e., metrics where the distances are integers between one and some upper bound B. We first prove appr...
متن کاملRational points near manifolds and metric Diophantine approximation
This work is motivated by problems on simultaneous Diophantine approximation on manifolds, namely, establishing Khintchine and Jarńık type theorems for submanifolds of Rn. These problems have attracted a lot of interest since Kleinbock and Margulis proved a related conjecture of Alan Baker and V.G. Sprindžuk. They have been settled for planar curves but remain open in higher dimensions. In this...
متن کاملAn algorithm for solving a diophantine equation with lower and upper bounds on the variables
We develop an algorithm for solving a diophantine equation with lower and upper bounds on the variables. The algorithm is based on lattice basis reduction, and rst nds short vectors satisfying the diophantine equation. The next step is to branch on linear combinations of these vectors, which either yields a vector that satis es the bound constraints or provides a proof that no such vector exist...
متن کامل